First-order convex feasibility algorithms for x-ray CT
نویسندگان
چکیده
منابع مشابه
First-order convex feasibility algorithms for x-ray CT.
PURPOSE Iterative image reconstruction (IIR) algorithms in computed tomography (CT) are based on algorithms for solving a particular optimization problem. Design of the IIR algorithm, therefore, is aided by knowledge of the solution to the optimization problem on which it is based. Often times, however, it is impractical to achieve accurate solution to the optimization of interest, which compli...
متن کاملAccelerating X-ray CT ordered subsets image reconstruction with Nesterov’s first-order methods
Low-dose X-ray CT can reduce the risk of cancer to patients. However, it requires computationally expensive statistical image reconstruction methods for improved image quality. Iterative algorithms require long compute times, so we focus on algorithms that “converge” in few iterations. This paper proposes to apply ordered subsets (OS) methods to Nesterov’s fast firstorder methods for 3D X-ray C...
متن کاملEmpirical correlation for porosity deduction from X-ray computed tomography (CT)
For obtaining reservoir petrophysical properties, for example porosity, non-destructive methods such as X-ray computed tomography, CT, seems to be precise and accurate. Porosity is deducted from the CT image with a single scan via different techniques, such as pore space detection by image segmentation techniques then correlation with porosity. More than one hundred samples with carbonate li...
متن کاملFirst-order Methods for Geodesically Convex Optimization
Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization, geodesically convex (g-convex) optimization is much less developed. In this paper we contribute to the understanding of g-convex optimization by developing iteration complexity analysis for several first-order algorithms on Hadamard manifolds. Specifically, we prove ...
متن کاملDistributed Algorithms for Solving a Class of Convex Feasibility Problems
In this paper, a class of convex feasibility problems (CFPs) are studied for multi-agent systems through local interactions. The objective is to search a feasible solution to the convex inequalities with some set constraints in a distributed manner. The distributed control algorithms, involving subgradient and projection, are proposed for both continuousand discrete-time systems, respectively. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Medical Physics
سال: 2013
ISSN: 0094-2405
DOI: 10.1118/1.4790698